1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts - LeetCode Solution

class Solution:
    def maxArea(self, h: int, w: int, horizontalCuts: List[int], verticalCuts: List[int]) -> int:
        a = -float("inf")
        b = -float("inf")

        j = 0

        horizontalCuts.sort()
        verticalCuts.sort()

        for i in range(len(horizontalCuts)):
            a = max(a, (horizontalCuts[i] - j))
            j = horizontalCuts[i]

        a = max(a, (h - j))
        j = 0

        for i in range(len(verticalCuts)):
            b = max(b, (verticalCuts[i] - j))
            j = verticalCuts[i]
        b = max(b, (w - j))

        return (a*b)%(10**9 + 7)